Network capacity with probit-based stochastic user equilibrium problem

نویسندگان

  • Lili Lu
  • Jian Wang
  • Pengjun Zheng
  • Wei Wang
چکیده

Among different stochastic user equilibrium (SUE) traffic assignment models, the Logit-based stochastic user equilibrium (SUE) is extensively investigated by researchers. It is constantly formulated as the low-level problem to describe the drivers' route choice behavior in bi-level problems such as network design, toll optimization et al. The Probit-based SUE model receives far less attention compared with Logit-based model albeit the assignment result is more consistent with drivers' behavior. It is well-known that due to the identical and irrelevant alternative (IIA) assumption, the Logit-based SUE model is incapable to deal with route overlapping problem and cannot account for perception variance with respect to trips. This paper aims to explore the network capacity with Probit-based traffic assignment model and investigate the differences of it is with Logit-based SUE traffic assignment models. The network capacity is formulated as a bi-level programming where the up-level program is to maximize the network capacity through optimizing input parameters (O-D multiplies and signal splits) while the low-level program is the Logit-based or Probit-based SUE problem formulated to model the drivers' route choice. A heuristic algorithm based on sensitivity analysis of SUE problem is detailed presented to solve the proposed bi-level program. Three numerical example networks are used to discuss the differences of network capacity between Logit-based SUE constraint and Probit-based SUE constraint. This study finds that while the network capacity show different results between Probit-based SUE and Logit-based SUE constraints, the variation pattern of network capacity with respect to increased level of travelers' information for general network under the two type of SUE problems is the same, and with certain level of travelers' information, both of them can achieve the same maximum network capacity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Benders\' Decomposition Based Solution Method for Solving User Equilibrium Problem: Deterministic and Stochastic Cases

The traffic assignment problem is one of the most important problems for analyzing and optimizing the transportation network to find optimal flows. This study presented a new formulation based on a generalized Benders' decomposition approach to solve its important part, i.e. user equilibrium problems, in deterministic and stochastic cases. The new approach decomposed the problem into a master p...

متن کامل

Sensitivity analysis of the variable demand probit stochastic user equilibrium with multiple user-classes

This paper presents a formulation of the multiple user class, variable demand, probit stochastic user equilibrium model (SUE). Sufficient conditions are stated for differentiability of the equilibrium flows of this model. This justifies the derivation of sensitivity expressions for the equilibrium flows. This paper then considers the network design problem (NDP), assuming that users’ responses ...

متن کامل

A Physarum-inspired Model for the Probit-based Stochastic User Equilibrium Problem

Stochastic user equilibrium is an important issue in the traffic assignment problems, tradition models for the stochastic user equilibrium problem are designed as mathematical programming problems. In this article, a Physaruminspired model for the probit-based stochastic user equilibrium problem is proposed. There are two main contributions of our work. On the one hand, the origin Physarum mode...

متن کامل

Probit-Based Traffic Assignment: A Comparative Study between Link-Based Simulation Algorithm and Path-Based Assignment and Generalization to Random-Coefficient Approach

Probabilistic approach of traffic assignment has been primarily developed to provide a more realistic and flexible theoretical framework to represent traveler’s route choice behavior in a transportation network. The problem of path overlapping in network modelling has been one of the main issues to be tackled. Due to its flexible covariance structure, probit model can adequately address the pro...

متن کامل

Dynamic Schedule-Based Assignment Model for Urban Rail Transit Network with Capacity Constraints

There is a great need for estimation of passenger flow temporal and spatial distribution in urban rail transit network. The literature review indicates that passenger flow assignment models considering capacity constraints with overload delay factor for in-vehicle crowding are limited in schedule-based network. This paper proposes a stochastic user equilibrium model for solving the assignment p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره 12  شماره 

صفحات  -

تاریخ انتشار 2017